Logarithmic convexity and geometric programming
نویسندگان
چکیده
منابع مشابه
Logarithmic Convexity of Gini Means
where x and y are positive variables and r and s are real variables. They are also called sum mean values. There has been a lot of literature such as [3, 4, 5, 6, 9, 10, 11, 12, 13, 19, 20, 21] and the related references therein about inequalities and properties of Gini means. The aim of this paper is to prove the monotonicity and logarithmic convexity of Gini means G(r, s;x, y) and related fun...
متن کاملA goal geometric programming problem (G2P2) with logarithmic deviational variables and its applications on two industrial problems
A very useful multi-objective technique is goal programming. There are many methodologies of goal programming such as weighted goal programming, min-max goal programming, and lexicographic goal programming. In this paper, weighted goal programming is reformulated as goal programming with logarithmic deviation variables. Here, a comparison of the proposed method and goal programming with weighte...
متن کاملConvexity and geometric probabilities
In the development of the subject of Geometric Probabilities, there was always a close relationship to Convex Geometry. In these lectures, I want to demonstrate this relationship with a number of examples. These examples are of different types, since I want to cover various aspects. I start with hitting probabilities for convex bodies, which can be treated by means of integral geometry. Then I ...
متن کاملImproved logarithmic-geometric mean inequality and its application
In this short note, we present a refinement of the logarithmic-geometric mean inequality. As an application of our result, we obtain an operator inequality associated with geometric and logarithmic means.
متن کاملTesting Geometric Convexity
We consider the problem of determining whether a given set S in R is approximately convex, i.e., if there is a convex set K ∈ R such that the volume of their symmetric difference is at most vol(S) for some given . When the set is presented only by a membership oracle and a random oracle, we show that the problem can be solved with high probability using poly(n)(c/ ) oracle calls and computation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1968
ISSN: 0022-247X
DOI: 10.1016/0022-247x(68)90039-5